Novel Methods for Solving Severely Ill-posed Linear Equations System
نویسندگان
چکیده
We treat an ill-posed system of linear equations by transforming it into a linear system of stiff ordinary differential equations (SODEs), adding a differential term on the left-hand side. In order to overcome the difficulty of numerical instability when integrating the SODEs, Liu [20] has combined nonstandard finite difference method and group-preserving scheme, namely the nonstandard group-preserving scheme (NGPS), to obtain an unconditional stable numerical method for SODEs. This paper applies the NGPS to the SODEs resulting from the ill-posed linear equations, and proves that the new algorithms are unconditional stable. To strengthen accuracy, an L-curve is used to select a suitable regularization parameter. Moreover, we also combine the NGPS with a newly developed fictitious time integration method (FTIM) from Liu and Atluri [29] to solve the ill-posed linear equations. Several numerical examples are examined and compared with exact solutions, revealing that the new algorithms have better computational efficiency and accuracy even for the highly ill-conditioned linear equations with a large disturbance on the given data.
منابع مشابه
A New Approach for Solving Heat and Mass Transfer Equations of Viscoelastic Nanofluids using Artificial Optimization Method
The behavior of many types of fluids can be simulated using differential equations. There are many approaches to solve differential equations, including analytical and numerical methods. However, solving an ill-posed high-order differential equation is still a major challenge. Generally, the governing differential equations of a viscoelastic nanofluid are ill-posed; hence, their solution is a c...
متن کاملIll-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملDouble Optimal Regularization Algorithms for Solving Ill-Posed Linear Problems under Large Noise
A double optimal solution of an n-dimensional system of linear equations Ax = b has been derived in an affine m-dimensional Krylov subspace with m n. We further develop a double optimal iterative algorithm (DOIA), with the descent direction z being solved from the residual equation Az = r0 by using its double optimal solution, to solve ill-posed linear problem under large noise. The DOIA is pro...
متن کاملSolving a nonlinear inverse system of Burgers equations
By applying finite difference formula to time discretization and the cubic B-splines for spatial variable, a numerical method for solving the inverse system of Burgers equations is presented. Also, the convergence analysis and stability for this problem are investigated and the order of convergence is obtained. By using two test problems, the accuracy of presented method is verified. Additional...
متن کاملOn the Choice of Subspace for Iterative Methods for Linear Discrete Ill-posed Problems
with a large matrix A of ill-determined rank. Thus, A has many “tiny” singular values of different orders of magnitude. In particular, A is severely ill-conditioned. Some of the singular values of A may be vanishing. We allow m ≥ n or m < n. The right-hand side vector b̃ is not required to be in the range of A. Linear systems of equations of the form (1) with a matrix of ill-determined rank are ...
متن کامل